package com.lsa.letcode.balanced_binary_tree;

import junit.framework.TestCase;

import org.junit.Assert;

import com.lsa.letcode.common.TreeNode;

public class SolutionTest extends TestCase {
	
	/**
	 *         1       
	 *        / \
	 *       2   3
	 *      /     \
	 *     4      
	 */
	public void testSolution() {
		TreeNode n1 = new TreeNode(1);
		n1.left = new TreeNode(2);
		n1.left.left = new TreeNode(4);
		n1.right = new TreeNode(3);
		
		Assert.assertEquals(2, Solution.heightIterative(n1));
	}
}
